Factorization of Q(h(T)(x)) over a finite field, where Q(x) is irreducible and h(T)(x) is linear II
نویسندگان
چکیده
منابع مشابه
Irreducible Monomial Linear Groups of Degree Four over Finite Fields
We describe an algorithm for explicitly listing the irreducible monomial subgroups of GL(n, q) , given a suitable list of finite irreducible monomial subgroups of GL(n, C) , where n is 4 or a prime, and q is a prime power. Particular attention is paid to the case n = 4, and the algorithm is illustrated for n = 4 and q = 5. Certain primitive permutation groups can be constructed from a list of i...
متن کاملFurther factorization of xn-1 over a finite field
Let $\Bbb F_q$ be a finite field with $q$ elements and $n$ a positive integer. Mart\'inez, Vergara and Oliveira \cite{MVO} explicitly factorized $x^{n} - 1$ over $\Bbb F_q$ under the condition of $rad(n)|(q-1)$. In this paper, suppose that $rad(n)\nmid (q-1)$ and $rad(n)|(q^w-1)$, where $w$ is a prime, we explicitly factorize $x^{n}-1$ into irreducible factors in $\Bbb F_q[x]$ and count the num...
متن کاملConnections between C(X) and C(Y), where Y is a subspace of X
In this paper, we introduce a method by which we can find a close connection between the set of prime $z$-ideals of $C(X)$ and the same of $C(Y)$, for some special subset $Y$ of $X$. For instance, if $Y=Coz(f)$ for some $fin C(X)$, then there exists a one-to-one correspondence between the set of prime $z$-ideals of $C(Y)$ and the set of prime $z$-ideals of $C(X)$ not containing $f$. Moreover, c...
متن کاملEnumerating all the Irreducible Polynomials over Finite Field
In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree n over a finite field and their roots in the extension field in quasilinear∗ time cost per element. Our algorithm is based on an improved algorithm for enumerating all the Lyndon words of length n in linear delay time and the known reduction of Lynd...
متن کاملIrreducible Polynomials over Finite Fields
As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1975
ISSN: 0024-3795
DOI: 10.1016/0024-3795(75)90117-2